An Optimal d−1-Fault-Tolerant Broadcasting Scheme for d-Dimensional Hypercubes

Broadcasting is the process of information dissemination in a communication network in which a message, originated by one member, is transmitted to all members of the network. We propose a k-fault-tolerant broadcasting scheme for a faulty d-dimensional hypercube where 0≤ k<d. For the whispering model, the new scheme requires 2d time units that are optimal for faulty-hypercubes. Moreover, it only requires 2d−1 time units for non-faulty hypercubes. For the shouting model, the new scheme requires d+1 time units that are optimal for faulty-hypercubes and d time units for non-faulty hypercubes. The new algorithm is simpler, faster, and requires n−d−1 fewer message transmissions than previously proposed optimal k-fault-tolerant broadcast schemes. keywords: Hypercube, Fault-tolerant, Broadcasting 1supported by the National Sciences and Engineering Research Council of Canada